Explicit Fusions

نویسندگان

  • Philippa Gardner
  • Lucian Wischik
چکیده

We introduce explicit fusions of names. An explicit fusion is a process that exists concurrently with the rest of the system and enables two names to be used interchangeably. Explicit fusions provide a small-step account of reaction in process calculi such as the pi calculus and the fusion calculus. In this respect they are similar to the explicit substitutions of Abadi, Cardelli and Curien, which do the same for the lambda calculus. In this paper, we give a technical foundation for explicit fusions. We present the pi-F calculus, a simple process calculus with explicit fusions, and define a strong bisimulation congruence. We study the embeddings of the fusion calculus and the pi calculus. The former is fully abstract with respect to bisimulation.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Explicit Fusions: Theory and Implementation

This work describes a concurrent, distributed abstract machine for the pi calculus. Its primary audience are researchers in the field of concurrency. The secondary audience are working programmers looking for a better way to write interactive programs. This audience need only read Chapters 1 (an overview) and 5 (the implementation). I hope that these chapters might prove appealing to students w...

متن کامل

A Category of Explicit Fusions

Name passing calculi are nowadays an established field on its own. Besides their practical relevance, they offered an intriguing challenge, since the standard operational, denotational and logical methods often proved inadequate to reason about these formalisms. A domain which has been successfully employed for languages with asymmetric communication, like the π-calculus, are presheaf categorie...

متن کامل

A Compositional Coalgebraic Model of a Fragment of Fusion Calculus

This work is a further step in exploring the labelled transitions and bisimulations of fusion calculi. We follow the approach developed by Turi and Plotkin for lifting transition systems with a syntactic structure to bialgebras and, thus, we provide a compositional model of the fusion calculus with explicit fusions. In such a model, the bisimilarity relation induced by the unique morphism to th...

متن کامل

The Fusion Machine

We present a new model for the distributed implementation of pilike calculi. This model is a close match to a variety of calculi, and so permits strong correctness results that are easy to prove. In particular, we describe a distributed abstract machine called the fusion machine. In it, only channels exist at runtime. It uses a form of concurrent constraints called fusions—equations on channel ...

متن کامل

ar X iv : h ep - t h / 02 09 02 0 v 1 2 S ep 2 00 2 Higher - genus su ( N ) fusion multiplicities as polytope volumes

We show how higher-genus su(N) fusion multiplicities may be computed as the discretized volumes of certain polytopes. The method is illustrated by explicit analyses of some su(3) and su(4) fusions, but applies to all higher-point and higher-genus su(N) fusions. It is based on an extension of the realm of Berenstein-Zelevinsky triangles by including so-called gluing and loop-gluing diagrams. The...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • Theor. Comput. Sci.

دوره 340  شماره 

صفحات  -

تاریخ انتشار 2000